Capturing matroid elements in unavoidable 3-connected minors
نویسندگان
چکیده
منابع مشابه
Capturing matroid elements in unavoidable 3-connected minors
A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connectedmatroidM has unavoidable structure. For everyn > 2, there is an integer f (n) so that if |E(M)| > f (n), thenM has aminor isomorphic to the rank-n wheel or whirl, a rank-n spike, the cycle or bond matroid of K3,n, or U2,n or Un−2,n. In this paper, we build on this result to determine what can be said about a large ...
متن کاملUnavoidable minors of large 4 - connected
11 It is known that any 3-connected matroid that is large enough is certain to contain 12 a minor of a given size belonging one of a few special classes of matroids. This 13 paper proves a similar unavoidable minor result for large 4-connected bicircular 14 matroids. The main result follows from establishing the list of unavoidable minors 15 of large 4-biconnected graphs, which are the graphs r...
متن کاملUnavoidable parallel minors of 4-connected graphs
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...
متن کاملOn Contracting Hyperplane Elements from a 3-connected Matroid
Let K̃3,n, n ≥ 3, be the simple graph obtained from K3,n by adding three edges to a vertex part of size three. We prove that if H is a hyperplane of a 3-connected matroid M and M 6∼= M∗(K̃3,n), then there is an element x in H such that the simple matroid associated with M/x is 3-connected.
متن کاملThe structure of a 3-connected matroid with a 3-separating set of essential elements
An element e of a 3–connected matroid M is essential if neither the deletion nor the contraction of e from M is 3–connected. Tutte’s 1966 Wheels and Whirls Theorem proves that the only 3–connected matroids in which every element is essential are the wheels and whirls. It was proved by Oxley and Wu that if a 3–connected matroid M has a non-essential element, then it has at least two such element...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2012
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.01.012